Commutativity in groups presented by finite Church-Rosser Thue systems
نویسندگان
چکیده
منابع مشابه
The Church-Rosser Property and Special Thue Systems
In an earlier paper we gave an O([ TI s) algorithm for testing the Church-Rosser property of Thue systems, where I TI is the total size of the Thue system. Here we improve that bound to O(klTI), where k is the number of rules in T, in the case when the Thue system is special, i.e., when all its rules are of the form (x, A) where A is the empty string. Also obtained are several results on specia...
متن کاملOn Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids
— Let M be an infinité commutative monoid. Suppose that M has a Church-Rosser présentation. If M is cancellative or if the présentation is special then M is either the free cyclic group or the free cyclic monoid. Résumé. — Soit M un monoide commutatif infini. Supposons que M possède une présentation finie ayant la propriété de « Church-Rosser ». Si M est simplifiable ou si la présentation est s...
متن کاملChurch-Rosser Groups and Growing Context-Sensitive Groups
A finitely generated group is called a Church-Rosser group (growing contextsensitive group) if it admits a finitely generated presentation for which the word problem is a Church-Rosser (growing context-sensitive) language. Although the ChurchRosser languages are incomparable to the context-free languages under set inclusion, they strictly contain the class of deterministic context-free language...
متن کاملFinite groups with three relative commutativity degrees
For a finite group $G$ and a subgroup $H$ of $G$, the relative commutativity degree of $H$ in $G$, denoted by $d(H,G)$, is the probability that an element of $H$ commutes with an element of $G$. Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$. It is shown that a finite group $G$ admits three relative commutativity degrees if a...
متن کاملA Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser
reduction systems (ARS) are abstract structures for studying general properties of rewriting systems. An ARS is just a set equipped with a set of binary relations. Despite this generality many aspects of rewriting systems can be approached in the theory of ARS, such as confluence and normalization. Moreover, important results have been stated and proved in this setting (examples are Newman’s le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1988
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1988220100931